منابع مشابه
On the continual Rubik’s cube
Let f and g be two continuous functions on the unit sphere Sn−1 in Rn , n ≥ 3, and let their restrictions to any one-dimensional great circle E coincide after some rotation φE of this circle: f (φE (θ)) = g(θ)∀θ ∈ E . We prove that in this case f (θ) = g(θ) or f (θ) = g(−θ) for all θ ∈ Sn−1. This answers the question posed by Richard Gardner and Vladimir Golubyatnikov. Published by Elsevier Inc.
متن کاملContinual On-Line Planning
My research proposes an approach to integrating planning and execution in time-sensitive environments, a setting I call continual on-line planning. New goals arrive stochastically during execution, the agent issues actions for execution one at a time, and the environment is otherwise deterministic. My dissertation will address this setting in three stages: optimizing total goal achievement time...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولDerangements on the n-cube
Chen, W.Y.C. and R.P. Stanley, Derangements on the n-cube, Discrete Mathematics 115 (1993) 65-15. Let Q. be the n-dimensional cube represented by a graph whose vertices are sequences of O’s and l’s of length n, where two vertices are adjacent if and only if they differ only at one position. A k-dimensional subcube or a k-face of Q. is a subgraph of Q. spanned by all the vertices u1 u2 u, with c...
متن کاملOn Computing the Data Cube
On-Line Analytical Processing (OLAP) applications often require computation of multiple related group-bys. This paper presents fast algorithms for computing a collection of groupbys. We focus rst on a special case of the aggregation problem|computation of the cube operator. The cube operator requires computing group-bys on all possible combinations of a list of attributes. Our algorithms extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2012
ISSN: 0001-8708
DOI: 10.1016/j.aim.2012.09.010